Kalman filtering with constrained output injection

نویسندگان

  • Jaganath Chandrasekar
  • Dennis S. Bernstein
  • Oscar Barrero
  • Bart De Moor
چکیده

The classical Kalman filter provides optimal least-squares estimates of all of the states of a linear time-varying system under process and measurement noise. In many applications, however, optimal estimates are desired for a specified subset of the system states, rather than all of the system states. For example, for systems arising from discretized partial differential equations, the chosen subset of states can represent a subregion of the spatial domain. However, it is well known that the optimal state estimator for a subset of system states coincides with the classical Kalman filter (Gelb 1974, pp. 104–109). For applications involving high-order systems, it is often difficult to implement the classical Kalman filter, and thus it is of interest to consider computationally simpler filters that yield suboptimal estimates of a specified subset of states. One approach to this problem is to consider reduced-order Kalman filters. These reduced-complexity filters provide state estimates that are suboptimal relative to the classical Kalman filter (Bernstein and Hyland 1985, Hippe and Wurmthaler 1990, Haddad and Bernstein 1990, Hsieh 2003). Alternative variants of the classical Kalman filter have been developed for computationally demanding applications such as weather forecasting (Farrell and Ioannou 2001, Heemink et al. 2001, Ballabrera et al. 2001, Fieguth et al. 2003), where the classical Kalman filter gain and covariance are modified so as to reduce the computational requirements. The present paper is motivated by computationally demanding applications such as those discussed in Farrell and Ioannou (2001), Heemink et al. (2001), Ballabrera et al. (2001) and Fieguth et al. (2003). For such applications, a high-order simulation model is assumed to be available, but the derivation of a reduced-order filter in the sense of Bernstein and Hyland (1985), Hippe and Wurmthaler (1990), Haddad and Bernstein (1990), Hsieh (2003) is not feasible due to the high dimensionality of the analytic model. Instead, we use a full-order state estimator based directly on the simulation model. However, rather than implementing the classical Kalman filter, we derive an optimal spatially localized Kalman filter in which the structure of the filter gain is constrained to reflect the desire to estimate a specified subset of states. Our development is also more general than the classical treatment since the state dimension can be time varying, which is useful for variable-resolution discretizations of partial differential equations. Some of the results in this paper appeared in Barerro et al. (2005). The use of a spatially localized Kalman filter in place of the classical Kalman filter is also motivated by computational architecture constraints arising from a multiprocessor implementation of the Kalman filter (Lawrie et al. 1992) in which the Kalman filter operations can be confined to the subset of processors associated with the states whose estimates are desired. *Corresponding author. Email: [email protected]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On-Line Nonlinear Dynamic Data Reconciliation Using Extended Kalman Filtering: Application to a Distillation Column and a CSTR

Extended Kalman Filtering (EKF) is a nonlinear dynamic data reconciliation (NDDR) method. One of its main advantages is its suitability for on-line applications. This paper presents an on-line NDDR method using EKF. It is implemented for two case studies, temperature measurements of a distillation column and concentration measurements of a CSTR. In each time step, random numbers with zero m...

متن کامل

Linear dynamic filtering with noisy input and output 1

We establish the equivalence between the optimal least-squares state estimator for a linear time-invariant dynamic system with noise corrupted input and output, and an appropriately modified Kalman filter. The approach used is algebraic and the result shows that the noisy input/output filtering problem is not fundamentally different from the classical Kalman filtering problem. The result is ill...

متن کامل

Linear dynamic filtering with noisy input and output 1 Ivan Markovsky and Bart

Estimation problems for linear time-invariant systems with noisy input and output are considered. The smoothing problem is a least norm problem. An efficient algorithm using a Riccati-type recursion is derived. The equivalence between the optimal filter and an appropriately modified Kalman filter is established. The optimal estimate of the input signal is derived from the optimal state estimate...

متن کامل

Applying Gaussian distributed constraints to Gaussian distributed variables

This paper develops an analytical method of truncating inequality constrained Gaussian distributed variables where the constraints are themselves described by Gaussian distributions. Existing truncation methods either assume hard constraints, or use numerical methods to handle uncertain constraints. The proposed approach introduces moment-based Gaussian approximations of the truncated distribut...

متن کامل

Constrained Kalman filtering via density function truncation for turbofan engine health estimation

Kalman filters are often used to estimate the state variables of a dynamic system. However, in the application of Kalman filters some known signal information is often either ignored or dealt with heuristically. For instance, state variable constraints (which may be based on physical considerations) are often neglected because they do not fit easily into the structure of the Kalman filter. This...

متن کامل

Linearly-constrained line-search algorithm for adaptive filtering

We develop a linearly-constrained line-search adaptive filtering algorithm by incorporating the linear constraints into the least squares problem and searching the solution (filter weights) along the Kalman gain vector. The proposed algorithm performs close to the constrained recursive least squares (CRLS) algorithm while having a computational complexity comparable to the constrained least mea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Int. J. Control

دوره 80  شماره 

صفحات  -

تاریخ انتشار 2007